IMPROVED BOUNDS ON THE NUMBER OF WAYS OF EXPRESSING t AS A BINOMIAL COEFFICIENT
نویسنده
چکیده
Let N(t) denote the number of ways of writing t as a binomial coefficient. We show that N(t) = O ( (log t)(log log log t) (log log t)3 ) .
منابع مشابه
Improved Bounds on the Number of was of Expressing t as a Binomial Coefficient
Let N(t) denote the number of ways of writing t as a binomial coefficient. We show that N(t) = O (log t)(log log log t) (log log t)3 .
متن کاملBinomial moments for divisible self-dual codes
For self-dual codes with all weights divisible by an integer greater than one, the minimum distance is bounded by the Mallows-Sloane upper bounds and by their improvements due to Krasikov-Litsyn and Rains. We obtain the improved upper bounds from short relations with constant coefficients on suitable binomial moments of the codes. In this approach, the Mallows-Sloane bounds are analogues of the...
متن کاملModeling the Number of Attacks in Multiple Sclerosis Patients Using Zero-Inflated Negative Binomial Model
Background and aims: Multiple sclerosis (MS) is an inflammatory disease of the central nervous system.The impact of the number of attacks on the disease is undeniable. The aim of this study was to analyze thenumber of attacks in these patients.Methods: In this descriptive-analytical study, the registered data of 1840 MS patients referred to the MS clinicof Ayatollah Kash...
متن کاملEnhanced Immune Responses of a Hepatitis C Virus core DNA Vaccine by co-Inoculating Interleukin-12 Expressing Vector in Mice
Background: Hepatitis C (HCV) is a worldwide problem without an effective vaccine with more than 170 million chronically infected people worldwide. DNA vaccines expressing antigenic portions of the virus with adjutants have recently been developed as a novel vaccination technology. Objectives: In the present study, a DNA vaccine expressing HCV core protein was developed with IL12 as a genetic a...
متن کاملGeneralization of binomial coefficients to numbers on the nodes of graphs . 1 Anna
The triangular array of binomial coefficients, or Pascal’s triangle, is formed by starting with an apex of 1. Every row of Pascal’s triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is equal to the number of ways the line-graph can be constructed when starting with this node and adding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007